A coalgebraic introduction to CSP

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Comparative Introduction to CSP, CCS and LOTOS

The language features and formal definitions of the three most popular process algebras, csp, ccs and lotos, are introduced and compared.

متن کامل

A Tutorial Introduction to CSP in Unifying Theories of Programming

In their Unifying Theories of Programming, Hoare & He use the alphabetised relational calculus to give denotational semantics to a wide variety of constructs taken from different programming paradigms. We give a tutorial introduction to the semantics of CSP processes. We start with a summarised introduction of the alphabetised relational calculus and the theory of designs, which are preconditio...

متن کامل

An Introduction to the Kent C++CSP Library

This paper reports on a CSP library for C++, developed over the past year at the University of Kent. It is based on the OO-design and API of JCSP and the lightweight algorithms of KRoC occam, with extensions to exploit specific C++ capabilities (such as templates). Both user-level and operating system threads are used to provide a range of implementation options and semantics (e.g. for managing...

متن کامل

Coalgebraic Up-to Techniques

A simple algorithm for checking language equivalence of finite automata consists in trying to compute a bisimulation that relates them. This is possible because language equivalence can be characterised coinductively, as the largest bisimulation. More precisely, consider an automaton 〈S, t, o〉, where S is a (finite) set of states, t : S → P(S) is a non-deterministic transition function, and o :...

متن کامل

Coalgebraic Bisimulation-Up-To

Bisimulation-up-to enhances the bisimulation proof method for process equivalence. We present its generalization from labelled transition systems to arbitrary coalgebras, and show that for a large class of systems, enhancements such as bisimulation up to bisimilarity, up to equivalence and up to context are sound proof techniques. This allows for simplified bisimulation proofs for many differen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Notes in Theoretical Computer Science

سال: 1999

ISSN: 1571-0661

DOI: 10.1016/s1571-0661(05)80269-5